Effect of Unfolding on the Spectral Statistics of Adjacency Matrices of Complex Networks

Random matrix theory is finding an increasing number of applications in the context of information theory and communication systems, especially in studying the properties of complex networks. Such properties include short-term and long-term correlation. We study the spectral fluctuations of the adjacency of networks using random-matrix theory. We consider the influence of the spectral unfolding, which is a necessary procedure to remove the secular properties of the spectrum, on different spectral statistics. We find that, while the spacing distribution of the eigenvalues shows little sensitivity to the unfolding method used, the spectral rigidity has greater sensitivity to unfolding.Comment: Complex Adaptive Systems Conference 201

Connectivity Analysis of Directed Highway VANETs using Graph Theory

Graph theory is a promising approach in handling the problem of estimating the connectivity probability of vehicular ad-hoc networks (VANETs). With a communication network represented as graph, graph connectivity indicators become valid for connectivity analysis of communication networks as well. In this article, we discuss two different graph-based methods for VANETs connectivity analysis showing that they capture the same behavior as estimated using probabilistic models. The study is, then, extended to include the case of directed VANETs, resulting from the utilization of different communication ranges by different vehicles. Overall, the graph-based methods prove a robust performance, as they can be simply diversified into scenarios that are too complex to acquire a rigid probabilistic model for them.Comment: 21 pages, 6 figure

Low Complexity V-BLAST MIMO-OFDM Detector by Successive Iterations Reduction

V-BLAST detection method suffers large computational complexity due to its successive detection of symbols. In this paper, we propose a modified V-BLAST algorithm to decrease the computational complexity by reducing the number of detection iterations required in MIMO communication systems. We begin by showing the existence of a maximum number of iterations, beyond which, no significant improvement is obtained. We establish a criterion for the number of maximum effective iterations. We propose a modified algorithm that uses the measured SNR to dynamically set the number of iterations to achieve an acceptable bit-error rate. Then, we replace the feedback algorithm with an approximate linear function to reduce the complexity. Simulations show that significant reduction in computational complexity is achieved compared to the ordinary V-BLAST, while maintaining a good BER performance.Comment: 6 pages, 7 figures, 2 tables. The final publication is available at www.aece.r